Entropy of Random Walk Range on Uniformly Transient and on Uniformly Recurrent Graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On uniformly balanced graphs

Let G = (V, E) be a simple graph. A vertex labeling f : V → {0, 1} induces a partial edge labeling f ∗ : E → {0, 1} defined by f ∗(uv) = f(u) 84 KWONG, LEE, LO, SU AND WANG if and only if f(u) = f(v). For i = 0, 1, let vf(i) = |{v ∈ V : f(v) = i}|, and ef (i) = |{e ∈ E : f ∗(e) = i}|. A graph G is uniformly balanced if |ef (0)−ef (1)| ≤ 1 for any vertex labeling f that satisfies |vf(0)−vf (1)| ...

متن کامل

On Uniformly Recurrent Morphic Sequences

In the paper we mainly deal with two well-known types of in nite words: morphic and uniformly recurrent (=almost periodic). We discuss the problem of nding criterion of uniform recurrence for morphic sequences and give e ective polynomial-time such criterion in two particular cases: pure morphic sequences and automatic sequences. We also prove that factor complexity of arbitrary uniformly recur...

متن کامل

Entropy of Random Walk Range

We study the entropy of the set traced by an n-step simple symmetric random walk on Z. We show that for d ≥ 3, the entropy is of order n. For d = 2, the entropy is of order n/ log n. These values are essentially governed by the size of the boundary of the trace.

متن کامل

Generating Labeled Planar Graphs Uniformly at Random

We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that count all such graphs with vertices and edges, based on a decomposition into 1-, 2-, and 3-connected components. For 3-connected graphs we apply a recent random generation algorithm by Schaeffer and a counting formula by Mulli...

متن کامل

Generating Outerplanar Graphs Uniformly at Random

We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a counting technique using the decomposition of a graph according to its block structure, and compute the exact number of labeled outerplanar graphs. This allows us to make the correct probabilistic choices in a recursiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2010

ISSN: 1083-6489

DOI: 10.1214/ejp.v15-787